منابع مشابه
Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs
Joseph Miller [16] and independently Andre Nies, Frank Stephan and Sebastiaan Terwijn [18] gave a complexity characterization of 2-random sequences in terms of plain Kolmogorov complexity C(·): they are sequences that have infinitely many initial segments with O(1)-maximal plain complexity (among the strings of the same length). Later Miller [17] showed that prefix complexity K(·) can also be u...
متن کاملContrasting Plain and Prefix-free Kolmogorov Complexity
Let SCRc = {σ ∈ 2n : K(σ) ≥ n + K(n) − c}, where K denotes prefix-free Kolmogorov complexity. These are the strings with essentially maximal prefix-free complexity. We prove that SCRc is not a Π1 set for sufficiently large c. This implies Solovay’s result that strings with maximal plain Kolmogorov complexity need not have maximal prefix-free Kolmogorov complexity, even up to a constant. We show...
متن کاملComplexity of Complexity and Strings with Maximal Plain and Prefix Kolmogorov Complexity
Peter Gacs showed [1] that for every n there exists a bit string x of length n whose plain complexity C (x) has almost maximal conditional complexity relative to x, i.e., C (C (x)|x) ≥ log n− log n−O(1). Here log(i) = log log i etc. Following Elena Kalinina [3], we provide a gametheoretic proof of this result; modifying her argument, we get a better (and tight) bound log n − O(1). We also show ...
متن کاملComplexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity
Peter Gacs showed [2] that for every n there exists a bit string x of length n whose plain complexity C (x) has almost maximal conditional complexity relative to x, i.e., C (C (x)|x)≥ logn− log logn−O(1). Following Elena Kalinina [3], we provide a gametheoretic proof of this result; modifying her argument, we get a better (and tight) bound logn−O(1). We also show the same bound for prefix-free ...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 1999
ISSN: 1076-2787,1099-0526
DOI: 10.1002/(sici)1099-0526(199903/04)4:4<72::aid-cplx9>3.0.co;2-g